A Graph Based Synthesis Algorithm for Solving CSPs
نویسندگان
چکیده
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an NP-complete task in general, it is believed that efficiency can be significantly improved by exploiting the characteristics of the problem. In this paper, we present a solution synthesis algorithm called ω-CDGT which is an existing algorithm named CDGT augmented with a constraint representative graph called ω-graph. We show that the worst-case complexity of the ω-CDGT algorithm is better than other related algorithms.
منابع مشابه
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. 'vfrhile solving a CSP is an NP-coiapktte task in geneid, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to...
متن کاملNogood-FC for solving partitionable constraint satisfaction problems
Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a g...
متن کاملA generic bounded backtracking framework for solving CSPs
This paper introduces a new generic backtracking framework for solving CSPs. This scheme exploits semantic and topological properties of the constraint network to produce goods and nogoods. It is based on a set of separators of the constraint graph and several procedures adjustable to exploit heuristics, filtering, backjumping techniques, classical nogood recording, topological (no)good recordi...
متن کاملReducing Redundancy in the Hypertree Decomposition Scheme
Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition. Abstract Hypertree decomposition is a powerful tec...
متن کاملSolving Difficult CSPs with Relational Neighborhood Inverse Consistency
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a strong local consistency property for binary CSPs. While enforcing NIC can significantly filter the variables domains, the proposed algorithm is too costly to be used on dense graphs or for lookahead during search. In this paper, we introduce and characterize Relational Neighborhood Inverse Consistency (RNIC) as a lo...
متن کامل